價格：免費
更新日期：2017-09-14
檔案大小：5.3M
目前版本：1.0
版本需求：Android 4.0 以上版本
官方網站：mailto:cdkakade1@gmail.com
The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:
1.Only one disk can be moved at a time.
2.Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack.
3.No disk may be placed on top of a smaller disk.
With 3 disks, the puzzle can be solved in 7 moves. The minimal number of moves required to solve a Tower of Hanoi puzzle is 2n(2 raise to n) − 1, where n is the number of disks.